Pc-matrices and the linear complementarity problem
نویسندگان
چکیده
منابع مشابه
Pc { Matrices and the Linear Complementarity
We introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q 2 I R n. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc \Q0. We further investigate the relationship of the ...
متن کاملThe extended linear complementarity problem
In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We show that the ELCP can be viewed as a kind of unifying framework for the LCP and its various generalizations. We study the general solution set of an ELCP and we develop an algorithm to find all its solutions. We also show that the general ELCP is a...
متن کاملThe Extended Linear Complementarity Problem
We consider an extension of the horizontal linear complementarityproblem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a ...
متن کاملBi-linear Complementarity Problem
In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient. Keywords—Bi-linear complementarity problem, Linear complementarity problem, Extended linear complementarity problem, Err...
متن کاملLinear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for *( ) P κ -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, (1 ) log n O n κ ε + , which is as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00362-9